Search results for "vector [form factor]"
showing 10 items of 770 documents
A secure intersection-based routing protocol for data collection in urban vehicular networks
2014
Data routing has gained great intention since the appearance of Vehicular Networks (VANETs). However, in the presence of attackers, reliable and trustworthy operations in such networks become impossible without securing routing protocols. In this paper, we target to study and design a secure routing protocol S-GyTAR for vehicular environments. Several kinds of routing techniques are proposed in the literature and could be classified into topology-based or position-based strategies. Position-based is the most investigated strategy in vehicular networks due to the unique characteristics of such networks. For this reason, this work is based on the well-known intersection-based routing protocol…
A dynamic multi-sink routing protocol for static and mobile self-organizing wireless networks: A routing protocol for Internet of Things
2021
Abstract With the rapid advent of using various devices like smart phones, vehicles etc, the connection of these devices with the help of Internet connectivity has emerged to IoT paradigm. The interconnection of smart objects under the various real world constraints like communication technologies, network scalability, node mobility, energy consumption etc, is a big challenge and requires designing new robust, adaptive, dynamic, and configurable routing protocols. With the arrival of the 5G and the future Internet, the latency time will be extremely reduced, this motivated us to propose a new protocol that entrust internet to transport a large part of control and data traffic of the network…
Evaluating a bound for MANETs routing protocols performance using graphs with activation windows
2008
In this paper we present an algorithm called STPA (shortest time path algorithm) which aims at providing a comparison tool for the evaluation of a bound for mobile ad hoc networks (MANETs) routing protocols performance. STPA provides an exhaustive evaluation of an ideal routing protocol. Based on the current position and state of the nodes it can determine factors like: how many complete messages get to the destination, which is the smallest amount of time required by a packet to get to the destination, which path followed each packet, and so on. This values would allow a protocol designer to improve or fine tune his proposal. We demonstrate that the complexity of the algorithm is O(sigma2)…
A new way of achieving multi-path routing in wireless networks
2020
In the 21st century, the wireless technology is still developing rapidly and trying to be 'Faster, Higher, and Stronger': faster data rate, higher bandwidth and stronger connectivity. Wireless Mesh Networks (WMN) have been envisioned as an important solution to the next generation wireless networking which can be used in wireless community networks, wireless enterprise networks, transportation systems, home networking and last-mile wireless internet access. They also provide a cheap, quick and effective way for building wireless data networks. Considering the nature of these networks, routing is a key process for operating the WMN. This paper proposes a new way of creating multi-path routin…
A hybrid bio-inspired approach to solving the routing problem in mobile ad hoc networks
2018
A mobile ad hoc network (MANET) is an autonomous system of mobile hosts (nodes) connected by a wireless link. However, the problem of designing routing protocols poses challenges to researchers due to the unpredictable and dynamic nature of ad hoc networks. Hence, bio-inspired algorithms are widely used to design adaptive routing strategies for MANETs. This paper proposes a routing protocol based on the hybridisation of ant colony optimisation (ACO) and 2-opt heuristic with the optimisation of ACO parameters. Given the vast scope of the parameters, a genetic algorithm is used to minimise the complexity of the problem. The implementation of the method is realised by MATLAB. To valid the resu…
Stable products of spheres in the non-linear coupling of oscillators or quasi-periodic motions
2004
Abstract For generic families of vector fields or transformations, normally hyperbolic invariant products of spheres appear near partially elliptic rest points. To cite this article: M. Kammerer-Colin de Verdiere, C. R. Acad. Sci. Paris, Ser. I 339 (2004).
A genetic algorithm approach to purify the classifier training labels for the analysis of remote sensing imagery
2017
This paper proposes a Genetic Algorithm (GA) approach to clean a given classifier training set for remote sensing image analysis. Starting from an initial set of training data, the new method called GA-Training Label Purifying (GA-TLP) consists of the significant training sample selection using GAs in order to maximize the classifier accuracy. This means to retain the most informative samples and to remove the uncertain, redundant, and misclassified ones. As a result of the selection process, we can obtain a purified training set. The proposed model is implemented and evaluated using a LANDSAT 7 ETM+ image. The experimental results confirm the effectiveness of the proposed approach.
The role of vector-baryon channels and resonances in the γp→K0Σ+ and γn→K0Σ0 reactions near the K⁎Λ threshold
2013
Abstract We have studied the γ p → K 0 Σ + reaction in the energy region around the K ⁎ Λ and K ⁎ Σ thresholds, where the CBELSA/TAPS cross section shows a sudden drop and the differential cross section experiences a transition from a forward-peaked distribution to a flat one. Our coupled-channel model incorporates the dynamics of the vector meson–baryon interaction which is obtained from the hidden gauge formalism. We find that the cross section in this energy region results from a delicate interference between amplitudes having K ⁎ Λ and K ⁎ Σ intermediate states. The sharp downfall is dictated by the presence of a nearby N ⁎ resonance produced by our model, a feature that we have employe…
On Obtaining Classification Confidence, Ranked Predictions and AUC with Tsetlin Machines
2020
Tsetlin machines (TMs) are a promising approach to machine learning that uses Tsetlin Automata to produce patterns in propositional logic, leading to binary (hard) classifications. In many applications, however, one needs to know the confidence of classifications, e.g. to facilitate risk management. In this paper, we propose a novel scheme for measuring TM confidence based on the logistic function, calculated from the propositional logic patterns that match the input. We then use this scheme to trade off precision against recall, producing area under receiver operating characteristic curves (AUC) for TMs. Empirically, using four real-world datasets, we show that AUC is a more sensitive meas…
A General Frame for Building Optimal Multiple SVM Kernels
2012
The aim of this paper is to define a general frame for building optimal multiple SVM kernels. Our scheme follows 5 steps: formal representation of the multiple kernels, structural representation, choice of genetic algorithm, SVM algorithm, and model evaluation. The computation of the optimal parameter values of SVM kernels is performed using an evolutionary method based on the SVM algorithm for evaluation of the quality of chromosomes. After the multiple kernel is found by the genetic algorithm we apply cross validation method for estimating the performance of our predictive model. We implemented and compared many hybrid methods derived from this scheme. Improved co-mutation operators are u…